Two Notes on Recursively Enumerable Sets
نویسنده
چکیده
Introduction. These notes are based on E. L. Post's paper Recursively enumerable sets of positive integers and their decision problems1 to which we shall refer as RES. The reader is assumed to be familiar with §§1-5 and 9 of this paper. In the first note we shall discuss some algebraic properties of simple and hypersimple sets. In the second note we shall prove the existence of a recursively enumerable set which is neither recursive nor creative nor simple and discuss its degree of unsolvability relative to one-one reducibility and relative to many-one reducibility.
منابع مشابه
Generating Sets for the Recursively Enumerable Turing Degrees
One of the recurrent themes in the area of the recursively enumerable (r.e.) degrees has been the study of the meet operator. While, trivially, the partial ordering of the r.e. degrees is an upper semi-lattice, i.e., the join ∗Lempp was partially supported by NSF grant DMS-0140120 and a Mercator Guest Professorship of the Deutsche Forschungsgemeinschaft. †Slaman was partially supported by the A...
متن کاملQuasicreative Sets1
The creative sets of Post [4] are the recursively enumerable sets whose complements are productive in the sense of Dekker [l]. In [l], Dekker introduces the class of semiproductive sets, which properly includes the class of productive sets. If we define a set to be semicreative if it is recursively enumerable and has a semiproductive complement, we obtain a natural generalization of creative se...
متن کاملOn the Degrees of Index Sets
A class of recursively enumerable sets may be classified either as an object in itself — the range of a two-place function in the obvious way — or by means of the corresponding set of indices. The latter approach is not only more precise but also, as we show below, provides an alternative method for solving certain problems on recursively enumerable sets and their degrees of unsolvability. The ...
متن کاملOn an Algebraic Classification of Multidimensional Recursively Enumerable Sets Expressible in Formal Arithmetical Systems
Algebraic representations of multidimensional recursively enumerable sets which are expressible in formal arithmetical systems based on the signatures ) , , , 0 ( S , ) , , , 0 ( S , ) , , 0 ( S , where 1 ) ( x x S , are introduced and investigated. The equivalence is established between the algebraic and logical representations of multidimensional recursively enumerable sets expr...
متن کاملA Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
A natural class of sentences about the lattice of recursively enumerable sets modulo finite sets is shown to be decidable. This class properly contains the class of sentences previously shown to be decidable by Lachlan. New structure results about the lattice of recursively enumerable sets are proved which play an important role in the decision procedure. 0. Introduction. Much of the recent wor...
متن کامل